Fractal Compression Using Ifs Operators on Transforms
نویسندگان
چکیده
Standard fractal image compression techniques rely on using an IFS operator directly on the image function. However, sometimes it is more convenient to work on some transformed version of the image. For example, an MRI image is scanned in as frequency data. Thus, it is more natural to work on the Fourier Transform of the image rather than on the image itself. Furthermore, if your image quality metric involves a transform, then again it is more natural to work in the transform domain than in the spatial domain. After giving a brief introduction to IFS fractals and classical fractal image compression, we go on to discuss some generalities of IFS operators on transform spaces. Then we give the examples of the Fourier Transform (DCT), the Wavelet Transform and the Lebesgue Transform. We emphasize that the operations can be done completely in the transform domain. In some applications, we never need to return to the spatial domain.
منابع مشابه
IFS-Type Operators on Integral Transforms
Most standard fractal image compression techniques rely on using an IFS operator directly on the image function. Sometimes, however , it is more convenient to work on a faithful representation of the image which, in certain applications, may be a transformed version of the image. For example, if an MRI image is scanned in as frequency data it may be more natural to work on the Fourier transform...
متن کاملTheory of Generalized Fractal Transforms
The most popular \fractal-based" algorithms for both the representation as well as compression of computer images have involved some implementation of the method of Iterated Function Systems (IFS) on complete metric spaces, e.g. IFS with probabilities (IFSP), Iterated Fuzzy Set Systems (IFZS), Fractal Transforms (FT), the Bath Fractal Transform (BFT) and IFS with grey-level maps (IFSM). (FT and...
متن کاملFractal Compression of Images with Projected Ifs
Standard fractal image compression, proposed by Jacquin[1], is based on IFS (Iterated Function Systems) defined in R. This modelization implies restrictions in the set of images being able to be compressed. These images have to be self similar in R. We propose a new model, the projected IFS, to approximate and code grey level images. This model has the ability to define affine IFS in a high dim...
متن کاملWavelet-Based Fractal Transforms for Image Coding with No Search
The compression performance of fractal image coding is considered using the wavelet-based fractal coder with no search or classi cation of the domain blocks. A new partitioning scheme is introduced as a variant of earlier schemes which further improves the compression performance. The Wavelet-Based Fractal Transform (WBFT) links the theory of multiresolution analysis (MRA) with iterated functio...
متن کاملDifference based Non-Linear Fractals using IFS
Fractals are self-similar images. There are many techniques for generating fractals. IFS are one of them. IFS use a set of linear transformations for generation of fractals. We propose a method of modifying IFS such that non-linear transformations can be used for generating pleasant looking fractals. We also show a technique which ensures convergence of the fractal Images. Non-linear fractals h...
متن کامل